Exchange lemmas 1 : Deng ’ s lemma ✩

نویسنده

  • Stephen Schecter
چکیده

Deng’s lemma gives estimates on the behavior of solutions of ordinary differential equations in the neighborhood of a partially hyperbolic equilibrium. We prove a generalization in which “partially hyperbolic equilibrium” is replaced by “normally hyperbolic invariant manifold.” © 2007 Elsevier Inc. All rights reserved. MSC: 34E15; 34B15; 34C30

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exchange lemmas 2 : General Exchange Lemma ✩

Exchange lemmas are used in geometric singular perturbation theory to track flows near normally hyperbolic invariant manifolds. We prove a General Exchange Lemma, and show that it implies versions of existing exchange lemmas for rectifiable slow flows and loss-of-stability turning points. © 2007 Elsevier Inc. All rights reserved. MSC: 34E15; 34C30

متن کامل

Further Formalization of the Process Algebra CCS in HOL4

In this project, we have extended previous work on the formalization of the process algebra CCS in HOL4. We have added full supports on weak bisimulation equivalence and observation congruence (rooted weak equivalence), with related definitions, theorems and algebraic laws. Some deep lemmas were also formally proved in this project, including Deng Lemma, Hennessy Lemma and several versions of t...

متن کامل

C. 3i Working Paper Alfred P. Sloan School of Management a Unified Approach to Some Combinatorial Lemmas in Topology a Unified Approach to Some Combinatorial Lemmas in Topology

Part II of this study uses the path-following theory of labelled V-complexes developed in Part I to provide constructive algorithmic proofs of a variety of combinatorial lenmas in topology. \Je demonstrate two new dual lemmas on the n-dimensional cube, and use a Generc.lized S ^erner Lemma to prove a gener lization of the Knaster-Kuratowski-y.azurkiewicz Covering Lemma on the simplex. We also s...

متن کامل

The Use of Lemmas in the Model Elimination

When the Model Elimination (ME) procedure was rst proposed, a notion of lemma was put forth as a promising augmentation to the basic complete proof procedure. Here the lemmas that are used are also discovered by the procedure in the same proof run. Several implementations of ME now exist but only a 1970's implementation explicitly examined this lemma mechanism, with indiierent results. We repor...

متن کامل

The Use of Lemmas in the Model

When the Model Elimination (ME) procedure was rst proposed, a notion of lemma was put forth as a promising augmentation to the basic complete proof procedure. Here the lemmas that are used are also discovered by the procedure in the same proof run. Several implementations of ME now exist but only a 1970's implementation explicitly examined this lemma mechanism, with indiierent results. We repor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007